Isosurface Extraction from Hybrid Unstructured Grids Containing Pentahedral Elements
نویسندگان
چکیده
Grid-based computational simulations often use hybrid unstructured grids consisting of various types of elements. Most commonly used elements are tetrahedral, pentahedral (namely, square pyramids and right triangular prisms) and hexahedral elements. Extracting isosurfaces of scalar fields defined on such hybrid unstructured grids is often done using indirect methods, such as, (a) subdividing all non-tetrahedral cells into tetrahedra and computing the triangulated isosurfaces using the marching tetrahedra algorithm, or (b) triangulating intersection points of edges of cells and computing the isosurface using a standard triangulation algorithm. Using the basic ideas underlying the well-established marching cubes and marching tetrahedra algorithms, which are applied to hexahedral and tetrahedral elements, respectively, we generate look-up tables for extracting isosurfaces directly from pentahedral elements. By using appropriate look-up tables, it is possible to process nearly all types of hybrid unstructured grids used in practical applications without the need for indirect methods. We construct look-up tables for square pyramidal and triangular prismatic cells with accurate topological considerations.
منابع مشابه
A Near Optimal Isosurface Extraction
| We present the \Near Optimal IsoSurface Extraction" (NOISE) algorithm for rapidly extracting isosurfaces from structured and unstructured grids. Using the span space, a new representation of the underlying domain, we develop an isosurface extraction algorithm with a worst case complexity of O(p n + k) for the search phase, where n is the size of the data set and k is the number of cells inter...
متن کاملSweeping Simplices: A Fast Iso-Surface Extraction Algorithm for Unstructured Grids
We present an algorithm that accelerates the extraction of iso-surfaces from unstructured grids by avoiding the traversal of the entire set of cells in the volume. The algorithm consists of a sweep algorithm and a data decomposition scheme. The sweep algorithm in-crementally locates intersected elements, and the data decomposition scheme restricts the algorithm's worst-case performance. For dat...
متن کاملA Near Optimal Isosurface Extraction Algorithm Using the Span Space - Visualization and Computer Graphics, IEEE Transactions on
We present the “Near Optimal IsoSurface Extraction” (NOISE) algorithm for rapidly extracting isosurfaces from structured and unstructured grids. Using the span space, a new representation of the underlying domain, we develop an isosurface extraction algorithm with a worst case complexity of o(& + c) for the search phase, where n is the size of the data set and k is the number of cells intersect...
متن کاملAlgorithmes sur GPU de visualisation et de calcul pour des maillages non-structurés
Most recent algorithms for Geometry Processing or Computational Fluid Dynamics (CFD) areusing new types of grids made of arbitrary polyhedra, in other words strongly unstructured grids. Incase of CFD simulations, these grids can be mapped with scalar or vector fields representing physicalproperties (for example : density, porosity, permeability).This thesis proposes new tools fo...
متن کاملHierarchical Visualization of Large-scale Unstructured Hexahedral Volume Data
Multi-block unstructured hexahedral grids are widely used in numerical simulations, but they cause various problems for data visualization due to the hangingnode problem. We present a multi-resolution approach for unstructured hexahedral grid visualization based on cost-minimizing face collapses. We resolve the hangingnode problem in its general form in order to generate visualizations using cu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012